Compression of Propositional Resolution Proofs by Lowering Subproofs
نویسندگان
چکیده
This paper describes a generalization of the LowerUnits algorithm [10] for the compression of propositional resolution proofs. The generalized algorithm, called LowerUnivalents, is able to lower not only units but also subproofs of non-unit clauses, provided that they satisfy some additional conditions. This new algorithm is particularly suited to be combined with the RecyclePivotsWithIntersection algorithm [10]. A formal proof that LowerUnivalents always compresses more than LowerUnits is shown, and both algorithms are empirically compared on thousands of proofs produced by the SMT-Solver veriT.
منابع مشابه
Towards the Compression of First-Order Resolution Proofs by Lowering Unit Clauses
The recently developed LowerUnits algorithm compresses propositional resolution proofs generated by SATand SMT-solvers by postponing and lowering resolution inferences involving unit clauses, which have exactly one literal. This paper describes a generalization of this algorithm to the case of first-order resolution proofs generated by automated theorem provers. An empirical evaluation of a sim...
متن کاملAn Intuitionistic and a Relevant Goal-Directed Proof Theory: a Further Study in Proof Heuristics
The introduction of techniques deriving from dynamic proofs – that are central in the adaptive logic program – allowed for the elaboration of a goal-directed proof format for propositional classical logic in [2]. These techniques enable one to write down search paths in the proofs themselves and from then on it is quite easy to develop a simple and perspicuous proof heuristics that warrants tha...
متن کاملFine Grained SMT Proofs for the Theory of Fixed-Width Bit-Vectors
Many high-level verification tools rely on SMT solvers to efficiently discharge complex verification conditions. Some applications require more than just a yes/no answer from the solver. For satisfiable quantifier-free problems, a satisfying assignment is a natural artifact. In the unsatisfiable case, an externally checkable proof can serve as a certificate of correctness and can be mined to ga...
متن کاملClausal Proof Compression Heule and Biere
Although clausal propositional proofs are significantly smaller compared to resolution proofs, their size on disk is still too large for several applications. In this paper we present several methods to compress clausal proofs. These methods are based on a two phase approach. The first phase consists of a light-weight compression algorithm that can easily be added to satisfiability solvers that...
متن کاملEPiC Series in Computing
Although clausal propositional proofs are significantly smaller compared to resolution proofs, their size on disk is still too large for several applications. In this paper we present several methods to compress clausal proofs. These methods are based on a two phase approach. The first phase consists of a light-weight compression algorithm that can easily be added to satisfiability solvers that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013